Institute for Research in Cognitive Science Typing Untyped

نویسنده

  • Jean Gallier
چکیده

It was observed by Curry that when (untyped)-terms can be assigned types, for example, simple types, these terms have nice properties (for example, they are strongly normalizing). Coppo, Dezani, and Veneri, introduced type systems using conjunctive t ypes, and showed that several important classes of (untyped) terms can be characterized according to the shape of the types that can be assigned to these terms. For example, the strongly normalizable terms, the normalizable terms, and the terms having head-normal forms, can be characterized in some systems D and D. The proofs use variants of the method of reducibility. In this paper, we p r e s e n t a uniform approach for proving several meta-theorems relating properties of-terms and their typa-bility in the systems D and D. Our proofs use a new and more modular version of the reducibility method. As an application of our metatheorems, we s h o w h o w t h e c haracterizations obtained by Coppo, Dezani, Veneri, and Pottinger, can be easily rederived. We a l s o c haracterize the terms that have w eak head-normal forms, which appears to be new. We conclude by stating a number of challenging open problems regarding possible generalizations of the realizability method.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Institute for Research in Cognitive Science Typing Untyped Lambda - Terms , or Reducibility Strikes Again !

It was observed by Curry that when (untyped)-terms can be assigned types, for example, simple types, these terms have nice properties (for example, they are strongly normalizing). Coppo, Dezani, and Veneri, introduced type systems using conjunctive types, and showed that several important classes of (untyped) terms can be characterized according to the shape of the types that can be assigned to...

متن کامل

Typing untyped λ - terms , or Reducibility strikes again !

It was observed by Curry that when (untyped) λ -terms can be assigned types,for example,simple types,these terms have nice properties (for example, they are strongly normalizing. Coppo, Dezani, and Veneri, introduced type systems using conjunctive types, and showed that several important classes of (untyped) terms can be characterized according to the shape of the types that can be assigned to ...

متن کامل

Typing theorems of omega algebra

Typed omega algebras extend Kozen’s typed Kleene algebras by an operation for infinite iteration in a similar way as Cohen’s omega algebras extend Kleene algebras in the untyped case. Typing these algebras is motivated by non-square matrices in automata constructions and applications in program semantics. For several reasons – the theory of untyped (Kleene or omega) algebras is well developed, ...

متن کامل

Typing Massive JSON Datasets

Cloud-specific languages are usually untyped, and no guarantees about the correctness of complex jobs can be statically obtained. Datasets too are usually untyped and no schema information is needed for their manipulation. In this paper we sketch a typing algorithm for JSON datasets. Our approach can be used to infer a succinct type from scratch for a collection of JSON objects, as well as to v...

متن کامل

Typing Untyped lambda-Terms, or Reducibility Strikes Again!

It was observed by Curry that when (untyped) λ-terms can be assigned types, for example, simple types, these terms have nice properties (for example, they are strongly normalizing). Coppo, Dezani, and Veneri, introduced type systems using conjunctive types, and showed that several important classes of (untyped) terms can be characterized according to the shape of the types that can be assigned ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995